北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2008, Vol. 31 ›› Issue (4): 130-134.doi: 10.13190/jbupt.200804.130.020

• 研究报告 • 上一篇    

改进的LDPC串行译码

杨 帆1,罗振东2,田宝玉1   

  1. 1.北京邮电大学 信息工程学院,北京 100876; 2. 贝尔实验室基础科学研究院(中国), 北京 100080
  • 收稿日期:2007-12-16 修回日期:1900-01-01 出版日期:2008-08-30 发布日期:2008-08-30
  • 通讯作者: 杨帆

A Modified Serial Decoding Algorithm for Low-Density
Parity-Check Codes

YANG Fan1, LUO Zhen-dong2, TIAN Bao-yu1   

  1. 1. School of Information Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China; 2. Bell Labs Research China, Beijing 100080, China)
  • Received:2007-12-16 Revised:1900-01-01 Online:2008-08-30 Published:2008-08-30
  • Contact: YANG Fan

摘要:

提出了一种改进的低密度奇偶校验码(LDPC)串行译码算法。与传统的串行译码算法不同的是,该算法只需在初始化时计算一次变量节点对校验节点软信息的求和式,而在译码过程中该式可通过简单地局部更新得到。与传统串行算法相比,所提算法在不降低性能的前提下,具有更低的计算复杂度和更高的处理速度。

关键词: 低密度奇偶校验码, 串行译码, 置信传播, 迭代译码

Abstract:

A modified serial decoding algorithm for low-density parity-check(LDPC) codes is proposed. Unlike conventional approaches, this algorithm calculates the sum of variable-to-check messages only once at the initialization stage, and then updates it by simple recursions during the decoding stage. Compared with the conventional serial LDPC decoding algorithm, the proposed algorithm has lower computational complexity and higher processing speed without any performance deterioration.

Key words: low-density parity-check codes, serial decoding, belief propagation, iterative decoding

中图分类号: